Path planning of the fruit tree pruning manipulator based on improved RRT-Connect algorithm

نویسندگان

چکیده

Aiming to realize the obstacle avoidance of fruit tree pruning manipulator in unstructured complex natural environment, an improved bidirectional fast extended random (RRT-Connect) algorithm was presented this study. The and obstacles were properly simplified based on their geometrical characteristics build collision detection models taking account obstacles, ground, itself carry out path planning. Goal-biased strategy adaptive step size adjustment principle introduced accelerate search speed. Bidirectional optimal cubic non-uniform B-spline interpolation method adopted optimize generated by RRT-Connect. simulation planning experiment carried system practical real platform. results showed that time length RRT-Connect reduced about 55% 60% respectively compared with basic algorithm. success rate 100%, planned smooth, continual executable, which could effectively guide avoid lead end effector goal point. proposed not only has certain application value for but also theoretical reference other types robots. Keywords: manipulator, planning, RRT-Connect, jujube pruning, avoidance, DOI: 10.25165/j.ijabe.20221502.6249 Citation: Chen Y Y, Fu X, Zhang B, W, Shen C J. Path Int J Agric & Biol Eng, 2022; 15(2): 177–188.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Method on Dynamic Path Planning for Robotic Manipulator Autonomous Obstacle Avoidance Based on an Improved RRT Algorithm

In a future intelligent factory, a robotic manipulator must work efficiently and safely in a Human-Robot collaborative and dynamic unstructured environment. Autonomous path planning is the most important issue which must be resolved first in the process of improving robotic manipulator intelligence. Among the path-planning methods, the Rapidly Exploring Random Tree (RRT) algorithm based on rand...

متن کامل

RRT-Connect: An Efficient Approach to Single-Query Path Planning

A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementally building two Rapidly-exploring Random Trees (RRTs) rooted at the start and the goal configurations. The trees each explore space around them and also advance towards each other through the use of a simple greedy heur...

متن کامل

Path planning of a Robot Manipulator using Retrieval RRT Strategy

This paper presents an algorithm which extends the rapidly-exploring random tree (RRT) framework to deal with change of the task environments. This algorithm called the Retrieval RRT Strategy (RRS) combines a support vector machine (SVM) and RRT and plans the robot motion in the presence of the change of the surrounding environment. This algorithm consists of two levels. At the first level, the...

متن کامل

Multi-vehicle planning using RRT-connect

The problem of planning multiple vehicles deals with the design of an effective algorithm that can cause multiple autonomous vehicles on the road to communicate and generate a collaborative optimal travel plan. Our modelling of the problem considers vehicles to vary greatly in terms of both size and speed, which makes it suboptimal to have a faster vehicle follow a slower vehicle or for vehicle...

متن کامل

Robot Path Planning Method Based on Improved Genetic Algorithm

This paper presents an improved genetic algorithm for mobile robot path planning. The algorithm uses artificial potential method to establish the initial population, and increases value weights in the fitness function, which increases the controllability of robot path length and path smoothness. In the new algorithm, a flip mutation operator is added, which ensures the individual population col...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Agricultural and Biological Engineering

سال: 2022

ISSN: ['1934-6352', '1934-6344']

DOI: https://doi.org/10.25165/j.ijabe.20221502.6249